An MDP-based Dynamic Pricing Scheme for Revenue Maximizing in Wireless Networks
نویسندگان
چکیده
Future communication networks are envisioned to be based upon a new communication paradigm which is user centric, i.e., users have freedom to choose a service provider to maximize their utilities. Pricing schemes adopted by service providers will impact the decision of users in selecting networks. In this paper, we formulate the problem as a Markov Decision Process (MDP) framework and apply Q-learning to design an optimal pricing policy that aims to maximize the long term revenue of the service provider. By applying dynamic pricing, each service provider operates an optimal policy to maximize its revenue. Simulation results show that our proposed framework is successful in maximizing the service provider’s revenue while supporting an appropriate level of user satisfaction in terms of price and call level quality of service. Keywords-revenue maximization; MDP; dynamic pricing; Qlearning; service provider
منابع مشابه
An-MDP based Dynamic Pricing and Revenue Maximization in Wireless Networks
In this paper, we propose a user centric based general framework for revenue maximization in highly competitive wireless networks. By applying dynamic pricing, each service provider operates an optimal policy that aims at maximizing its revenue. The problem is formulated using the Markov Decision Process (MDP) framework and Qlearning is applied to determine an optimal policy which maximizes the...
متن کاملRevenue-aware Resource Allocation Scheme in Multiservice IP Networks
In the future IP networks, a wide range of different service classes must be supported and different classes of customers will pay different prices for their used network resources based on Service-Level-Agreements. In this paper, we link resource allocation scheme with pricing strategies and explore the problem of maximizing the revenue of network providers by resource allocation among multipl...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملHypercube Bivariate-Based Key Management for Wireless Sensor Networks
Wireless sensor networks are composed of very small devices, called sensor nodes,for numerous applications in the environment. In adversarial environments, the securitybecomes a crucial issue in wireless sensor networks (WSNs). There are various securityservices in WSNs such as key management, authentication, and pairwise keyestablishment. Due to some limitations on sensor nodes, the previous k...
متن کاملHybrid Key pre-distribution scheme for wireless sensor network based on combinatorial design
Key distribution is an important problem in wireless sensor networks where sensor nodesare randomly scattered in adversarial environments.Due to the random deployment of sensors, a list of keys must be pre-distributed to each sensor node before deployment. To establish a secure communication, two nodes must share common key from their key-rings. Otherwise, they can find a key- path in which ens...
متن کامل